منابع مشابه
Coequational logic for accessible functors
Covarieties of coalgebras are those classes of coalgebras for an endofunctor H on the category of sets that are closed under coproducts, subcoalgebras and quotients. Equivalently, covarieties are classes of H-coalgebras that can be presented by coequations. Adámek introduced a logic of coequations and proved soundness and completeness for all polynomial functors on the category of sets. Here th...
متن کاملCoequational Logic for Finitary Functors
Coequations, which are subsets of a cofree coalgebra, can be viewed as properties of systems. In case of a polynomial functor, a logic of coequations was formulated by J. Adámek. However, the logic is more complicated for other functors than polynomial ones, and simple deduction rules can no longer be formulated. A simpler coequational logic for finitely branching labelled transition systems wa...
متن کاملMonoidal Company for Accessible Functors
Distributive laws between functors are a fundamental tool in the theory of coalgebras. In the context of coinduction in complete lattices, they correspond to the so-called compatible functions, which enable enhancements of the coinductive proof technique. Amongst these, the greatest compatible function, called the companion, has recently been shown to satisfy many good properties. Categorically...
متن کاملElementary Equivalences and Accessible Functors
We introduce the notion of λ-equivalence and λ-embeddings of objects in suitable categories. This notion specializes to L∞λ-equivalence and L∞λ-elementary embedding for categories of structures in a language of arity less than λ, and interacts well with functors and λ-directed colimits. We recover and extend results of Feferman and Eklof on “local functors” without fixing a language in advance....
متن کاملAccessible functors and final coalgebras for named sets
In the field of programming language semantics and concurrency theory, wide attention is paid to the so called name-passing calculi, i.e. formalisms where name generation and passing play a fundamental role. A prototypical example is provided by the π-calculus. The peculiarities of name passing required to refine existing theoretical models and to invent new ones, such as coalgebras over preshe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2010
ISSN: 0890-5401
DOI: 10.1016/j.ic.2009.10.010